Constraint-based proactive scheduling for MPTCP in wireless networks
نویسندگان
چکیده
Multipath TCP (MPTCP) is one of the leading protocols that support multipath operation in a transport layer. However, depending on the network and the receiver buffer, the original MPTCP can experience throughput degradation, underutilizing the network capacity compared to the regular TCP. Furthermore, MPTCP can result in a large packet interval. In this paper, we propose a new scheduling scheme for MPTCP that performs packet scheduling according to the receiver buffer and network delay. Our scheme estimates out-of-order packets according to performance differences between subflows and assigns data packets to subflows by comparing the estimated out-of-order packets and the buffer size. Moreover, our scheme can adjust the trade-off between throughput and delay performance using a delay constraint. We implement the proposed scheduling in the Linux kernel and evaluate its performance over a virtual network framework using NS-3 and real networks. The results show that the proposed scheduling scheme performs efficient packet transmission regardless of the performance differences of multiple paths and buffer size. Moreover, the proposed scheduling can complement and cooperate with an existing non-scheduling-based solution. © 2015 Elsevier B.V. All rights reserved.
منابع مشابه
A JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملQuasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملMLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کاملEvaluating Multipath TCP Resilience against Link Failures
Standard TCP is the de facto reliable transfer protocol for the Internet. It is designed to establish a reliable connection using only a single network interface. However, standard TCP with single interfacing performs poorly due to intermittent node connectivity. This requires the re-establishment of connections as the IP addresses change. Multi-path TCP (MPTCP) has emerged to utilize multiple ...
متن کاملAssessment of DSACC and QPART Algorithms in Ad Hoc Networks
The rapid advancement in wireless over wired has augmented the need for improving theQuality of Service (QoS) over such wireless links. However, the wireless ad hoc networkshave too low bandwidth, and establishing a QoS in these networks is a difficult issue. So,support of quality of service in ad hoc networks is the topical issue among the networkscience researchers. In this research we are go...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Networks
دوره 91 شماره
صفحات -
تاریخ انتشار 2015